Local Adaptive Importance Sampling for Multivariate Densities with Strong Nonlinear Relationships

نویسندگان

  • Geof H. Givens
  • Adrian E. Raftery
چکیده

We consider adaptive importance sampling techniques which use kernel density estimates at each iteration as importance sampling functions. These can provide more nearly constant importance weights and more precise estimates of quantities of interest than the SIR algorithm when the initial importance sampling function is di use relative to the target. We propose a new method which adapts to the varying local structure of the target. When the target has unusual structure, such as strong nonlinear relationships between variables, this method provides estimates with smaller MSE than alternative methods.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive importance sampling in general mixture classes

In this paper, we propose an adaptive algorithm that iteratively updates both the weights and component parameters of a mixture importance sampling density so as to optimise the importance sampling performances, as measured by an entropy criterion. The method is shown to be applicable to a wide class of importance sampling densities, which includes in particular mixtures of multivariate Student...

متن کامل

Importance Sampling for Multimodal Functions and Application to Pricing Exotic Options

We consider importance sampling (IS) to increase the efficiency of Monte Carlo integration, especially for pricing exotic options where the random input is multivariate Normal. When the importance function (the product of integrand and original density) is multimodal, determining a good IS density is a difficult task. We propose an Automated Importance Sampling DEnsity selection procedure (AISD...

متن کامل

Cross-Entropy Probabilistic Motion Planning

This work, initially presented in [1], considers motion planning for nonlinear robotic systems operating in constrained environments. Motivated by recent developments in sampling-based motion planning and Monte Carlo optimization we propose a general randomized path planning method based on sampling in the space of trajectories. The idea is to construct a probability distribution over the set o...

متن کامل

An Adaptive Population Importance Sampler: Learning from Errors

Monte Carlo (MC) methods are well-known computational techniques in different fields as signal processing, communications, and machine learning. An important class of MC methods is composed of importance sampling (IS) and its adaptive extensions, e.g., Adaptive Multiple IS (AMIS) and Population Monte Carlo (PMC). In this work, we introduce an adaptive and iterated importance sampler using a pop...

متن کامل

Optimal tests for homogeneity of covariance, scale, and shape

The assumption of homogeneity of covariance matrices is the fundamental prerequisite of a number of classical procedures in multivariate analysis. Despite its importance and long history, however, this problem so far has not been completely settled beyond the traditional and highly unrealistic context of multivariate Gaussian models. And the modified likelihood ratio tests (MLRT) that are used ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993